A Faster Algorithm for Finding Disjoint Ordering of Sets
نویسندگان
چکیده
منابع مشابه
A new algorithm for finding vertex-disjoint paths
The fact that the demands which could be labelled as “luxurious” in the past times, have became requirements makes it inevitable that the service providers do new researches and prepare alternative plans under harsh competition conditions. In order to provide the customers with the services in terms of the committed standards by taking the possible damages on wired and wireless networks into co...
متن کاملA Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets
In this paper we present a new algorithm for merging two linearly ordered sets which requires substantially fewer comparisons than the commonly used tape merge or binary insertion algorithms. Bounds on the difference between the number of comparisons required by this algorithm and the information theory lower bounds are derived. Results from a computer implementation of the new algorithm are gi...
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملA Faster Subquadratic Algorithm for Finding Outlier Correlations
We study the problem of detecting outlier pairs of strongly correlated variables among a collection of n variables with otherwise weak pairwise correlations. After normalization, this task amounts to the geometric task where we are given as input a set of n vectors with unit Euclidean norm and dimension d, and we are asked to find all the outlier pairs of vectors whose inner product is at least...
متن کاملAlgorithm for Finding Maximal Frequent Sets
Given a set X and a set C of subsets of X, subsets of X covered by k sets in C are called k-frequent. Frequent sets are of interest in large scale data analysis, pattern recognition and data mining. Characterization of maximal kfrequent sets in terms of equivalence relation and partial order is given. A general algorithm for finding maximal k-frequent sets, efficient for wide range of practical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Networking and Computing
سال: 2013
ISSN: 2185-2839,2185-2847
DOI: 10.15803/ijnc.3.2_182